Saddle Points

نویسندگان

  • Tihomir Asparouhov
  • Bengt Muthén
چکیده

To compute the maximum likelihood estimates the log-likelihood function L is maximized with respect to all model parameters. To check that the maximization has been achieved two things have to be satisfied: 1. The vector of first derivatives with respect to the model parameter L′ should be equal to 0. 2. The negative of the matrix of the second derivatives −L′′ should be a positive definite matrix. Most maximization algorithms are based on following the direction of the derivative until maximization and thus continue iterating through the parameter spaces until condition 1 is met. At that point the maximization algorithm has no direction to move on and stops hoping that condition 2 is also satisfied. After the iterations are completed condition 2 is checked and if it is satisfied then Mplus will conclude that indeed the maximization is complete. If the ML estimator is used then the information matrix (−L′′)−1 is used as the estimator of the asymptotic variance covariance for the parameter estimates. If the MLF estimator is used the estimator for the asymptotic variance covariance is given by L′(L′)T where the bar symbol here means averaging over the independent units in the data (observations in single level models or clusters in multilevel models). If the MLR estimator is used the estimator for the asymptotic variance covariance is given by (−L′′)−1L′(L′)T (−L′′)−1. All three estimators are asymptotically equivalent when the model is correctly specified, however for small or medium sample size the MLF estimator may overestimate the standard errors. This is particularly the case if the ratio between the number of independent units

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Locating and Characterizing the Stationary Points of the Extended Rosenbrock Function

Two variants of the extended Rosenbrock function are analyzed in order to find the stationary points. The first variant is shown to possess a single stationary point, the global minimum. The second variant has numerous stationary points for high dimensionality. A previously proposed method is shown to be numerically intractable, requiring arbitrary precision computation in many cases to enumera...

متن کامل

On the existence of saddle points for nonlinear second-order cone programming problems

In this paper, we study the existence of local and global saddle points for nonlinear second-order cone programming problems. The existence of local saddle points is developed by using the second-order sufficient conditions, in which a sigma-term is added to reflect the curvature of second-order cone. Furthermore, by dealing with the perturbation of the primal problem, we establish the existenc...

متن کامل

A Stability Boundary Based Method for Finding Saddle Points on Potential Energy Surfaces

The task of finding saddle points on potential energy surfaces plays a crucial role in understanding the dynamics of a micromolecule as well as in studying the folding pathways of macromolecules like proteins. The problem of finding the saddle points on a high dimensional potential energy surface is transformed into the problem of finding decomposition points of its corresponding nonlinear dyna...

متن کامل

A method for finding the ridge between saddle points applied to rare event rate estimates.

A method is presented for finding the ridge between first order saddle points on a multidimensional surface. For atomic scale systems, such saddle points on the energy surface correspond to atomic rearrangement mechanisms. Information about the ridge can be used to test the validity of the harmonic approximation to transition state theory, in particular to verify that second order saddle points...

متن کامل

Looking for order in the optical design landscape

In present-day optical system design, it is tacitly assumed that local minima are points in the merit function landscape without relationships between them. We will show however that there is a certain degree of order in the design landscape and that this order is best observed when we change the dimensionality of the optimization problem and when we consider not only local minima, but saddle p...

متن کامل

On the Convergence of Min/sup Points in Optimal Control Problems

In case f0 and C are convex, a variety of primal/dual numerical methods can be used to find the saddle points of a Lagrangian L associated with this problem [4, 7]. These methods take advantage of the fact that the search for the saddle points of L is unconstrained, or conducted over sets much simpler than C. Furthermore, we can introduce penalties on f0 in a way that regularizes L and makes it...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012